Computational Light Routing

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computational Approaches to Stochastic Vehicle Routing Problems

We develop and test several heuristics for two well-known vehicle routing problems which have stochastic demand: the probabilistic traveling salesman problem (PTSP) and the probabilistic vehicle routing problem (PVRP). The goal in these problems is to obtain optimal a priori tours, that is, tours which are designed before demands are known. We develop a number of heuristics which lead to such s...

متن کامل

Light graphs with small routing cost

Let G = ({1, . . . , n}, E, w) be an undirected graph with nonnegative edge weights w and let aij be the nonnegative requirement between vertices i and j. For any spanning subgraph H of G, the weight of H is the total weight of its edges and the routing cost of H is ∑ i<j aijdH(i, j), where dH(i, j) is the distance between i and j in H. In this paper, we investigated two special cases of the pr...

متن کامل

Magnetic routing of light-induced waveguides

Among photofunctional materials that can be employed to control the propagation of light by modifying their properties, soft dielectrics such as nematic liquid crystals (NLCs) stand out for their large all-optical response. Through reorientation, the molecular distribution of NLCs can be modified by the electric field of light, permitting functional operations and supporting self-localized ligh...

متن کامل

Optimal Control of Light Propagation Governed by Eikonal Equation within Inhomogeneous Media Using Computational Adjoint Approach

A mathematical model is presented in the present study to control‎ ‎the light propagation in an inhomogeneous media‎. ‎The method is ‎based on the identification of the optimal materials distribution‎ ‎in the media such that the trajectories of light rays follow the‎ ‎desired path‎. ‎The problem is formulated as a distributed parameter ‎identification problem and it is solved by a numerical met...

متن کامل

Light-Weight Entailment Checking for Computational Semantics

Inference tasks in computational semantics have mostly been tackled by means of first-order theorem proving tools. While this is an important and welcome development, it has some inherent limitations. First, generating first-order logic representations of natural language documents is hampered by the lack of efficient and sufficiently robust NLP tools. Second, the computational costs of deployi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Graphics

سال: 2014

ISSN: 0730-0301,1557-7368

DOI: 10.1145/2602140